Decentralized Consensus Optimization Based on Parallel Random Walk
نویسندگان
چکیده
منابع مشابه
Random Walk Distributed Dual Averaging Method For Decentralized Consensus Optimization
In this paper, we address the problem of distributed learning over a decentralized network, arising from scenarios including distributed sensors or geographically separated data centers. We propose a fully distributed algorithm called random walk distributed dual averaging (RW-DDA) that only requires local updates. Our RW-DDA method, improves the existing distributed dual averaging (DDA) method...
متن کاملRandom Walk Distributed Dual Averaging Method For Decentralized Consensus Optimization
In this paper, we address the problem of distributed learning over a large number of distributed sensors or geographically separated data centers, which suffer from sampling biases across nodes. We propose an algorithm called random walk distributed dual averaging (RW-DDA) method that only requires local updates and is fully distributed. Our RW-DDA method is robust to the change in network topo...
متن کاملDecentralized Random Walk-Based Data Collection in Networks
We analyze a decentralized random-walk based algorithm for data collection at the sink in a multi-hop sensor network. Our algorithm, Metropolis-Collect, which involves data packets being passed to random neighbors in the network according to a simple metropolis randomwalk mechanism, requires no configuration and incurs no routing overhead. To analyze this method, we model the data generation pr...
متن کاملDecentralized Consensus Optimization with Asynchrony and Delay
We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs in a network of agents, where the agents perform local computation and communicate with neighbors. We design our algorithm so that the agents can compute and communicate independently, at different times, for different durations. This reduces the waiting time for the slowest agent or longest commu...
متن کاملParallel Random Walk Based Heuristics for Semi-Formal Verification
We explore the use of distributed processing to enhance the performance of explicit state enumeration based safety model-checking. A central problem in distributed model-checking is checking whether a state generated by a processor has already been visited by another processor. This requires hash-table look-up messages to be exchanged. These messages can dramatically offset, or even nullify, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2020
ISSN: 1089-7798,1558-2558,2373-7891
DOI: 10.1109/lcomm.2019.2955442